evalu user effect exploratori search touchgraph googl interfac simul model movabl hospit asset manag rfid sensor user interfac exploit web commun search web embed complet binari tree product graph speedup scalabl spmd comput workstat cluster speedup scalabl spmd comput workstat cluster optim emul vlsi layout complet binari tree effici vlsi layout homogen product network paper develop gener method layout homogen product network number dimens analyz vlsi complex deriv upper lower bound area maximum wire length literatur lower bound gener obtain comput lower bound bisect width cross number network laid paper defin measur call maxim congest obtain bisect width cross number unifi approach upper bound tradition obtain construct layout base separ bifurc method basic limit applic graph bound vertex degre separ approach gener yield good layout good separ found difficult find good separ arbitrari graph bifurc approach easier appli gener gener algorithm parallel sort product network gener odd merg sort algorithm origin due batcher show gener algorithm appli sort product network arbitrari factor graph node dimension product node algorithm sort kei store dimension product time depend show factor graph establish upper bound time complex sort kei product network bound lead asymptot complex sort kei optim instanc product network factor graph log lead asymptot run time log sort kei bound hypercub asymptot complex show appli algorithm ca embed complet binari tree product graph effect queue strategi dschedul pool processor mesh dconnect tree bridg grid mesh tree grid mesh tree mot parallel architectur literatur enjoi effici vlsi layout simplic topolog larg number parallel algorithm effici execut drawback architectur algorithm perform perform gap algorithm capabl architectur propos class parallel architectur call mesh connect tree mct execut grid algorithm effici grid mot algorithm effici mot constant amount slowdown mct topolog mot subgraph emul grid embed dilat congest signific amount comput versatil offer mct addit vlsi area cost earlier network topolog gener algorithm parallel sort product network gener odd merg sort algorithm origin due batcher show gener algorithm appli sort product network arbitrari factor graph node dimension product node algorithm sort kei store dimension product time depend show factor graph establish upper bound time complex sort kei product network bound lead asymptot complex sort kei optim instanc product network factor graph log lead asymptot run time log sort kei bound hypercub asymptot complex show appli algorithm ca embed larg complet binari tree hypercub load balanc gener algorithm parallel sort product network gener odd merg sort algorithm origin due batcher show gener algorithm appli sort product network arbitrari factor graph node dimension product node algorithm sort kei store dimension product time depend show factor graph establish upper bound time complex sort kei product network bound lead asymptot complex sort kei optim instanc product network factor graph log lead asymptot run time log sort kei bound hypercub asymptot complex show appli algorithm ca optim schedul comput dintens task network workstat product network logarithm diamet fix degre paper present gener properti product network pertin parallel architectur focus case studi product complet binari tree shuffl exchang de bruijn network shown power architectur parallel comput evidenc abil effici emul numer architectur dimension grid dimension mesh tree embed effici product graph subgraph small constant dilat congest addit shuffl exchang network embed dimension product shuffl exchang network dilat cost congest cost similarli de bruijn network embed dimension product de bruijn network dilat cost congest cost shuffl exchang de bruijn graph emul hypercu comput properti mesh connect tree versatil architectur parallel comput recent mesh connect tree mct network propos asaposs architectur parallel comput mct network obtain bycombin complet binari tree cross product oper paper focus structur embed rout layout properti mct network show mct network computation power grid complet binari tree power mesh tree mot analysi vlsi complex show addit power obtain asymptot increas layout area withrespect grid dimens mot number dimens variat basic architectur maximum vertex degre asymptot area complex investig variat toru subgraph mot increas comput power basic architectur result suggest basic mct network variant suitabl architectur larg class massiv parallel comput queue perform analysi dschedul pool processor environ topolog properti cross cube architectur topolog properti cross cube architectur perform dschedul network workstat embed larg mesh tree relat network hypercub load balanc reconfigur cube architectur parallel comput cross cube architectur parallel comput load balanc network cooper congest fault toler binari tree embed hypercub analyt model predict perform heterogen system variat hypercub lower diamet embed mesh tree hypercub embed architectur provid architectur abstract topolog embed algorithm origin develop architectur directli map architectur paper describ method embed dimension mesh tree hypercub similar method embed higher dimension mesh tree embed signific practic import enhanc capabl hypercuh mesh tree enabl extrem fast parallel comput embed mesh tree hypercub embed architectur provid architectur abstract topolog embed algorithm origin develop architectur directli map architectur paper describ method embed dimension mesh tree hypercub similar method embed higher dimension mesh tree embed signific practic import enhanc capabl hypercuh mesh tree enabl extrem fast parallel comput heurist algorithm adapt load share local network propos solut problem level error dmessag gener propos solut problem level error dmessag gener 